Extremal problems under dimension constraints
نویسندگان
چکیده
The aim of this paper is to systematically present an area of extremal problems under dimension constraints. We state conjectures and solutions for many of these problems. Proofs will be given in several papers, each devoted to a specific problem.
منابع مشابه
Maximal antichains under dimension constraints
We consider A(n, k) = maxA{|A| : dim(A) ≤ k, A ⊂ {0, 1} n is an antichain}, where the dimension is taken from the linear span of A in R, we conjecture the exact value of A(n, k) and we prove this conjecture for all n and k ≤ ⌊ n 2 ⌋ +1 or k = n−1. This is a contribution to the program of systematic investigation of extremal problems under dimension constraints, which was recently presented by t...
متن کاملIntersection theorems under dimension constraints
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formulation of our problem is as follows. Given integers 0 ≤ t, k ≤ n determine or estimate the maximum number of (0, 1)–vectors in a k–dimensional subspace of the Euclidean n–space Rn, such that the inner product (“intersec...
متن کاملMethods for Solving Extremal Problems in Practice
During the 20th century there has been an incredible progress in solving theoretically hard problems in practice. One of the most prominent examples is the DPLL algorithm and its derivatives to solve the Boolean satisfiability problem, which can handle instances with millions of variables and clauses in reasonable time, notwithstanding the theoretical difficulty of solving the problem. Despite ...
متن کاملRelaxation of Three Solenoidal Wells and Characterization of Extremal Three-phase H-measures
We fully characterize quasiconvex hulls for three arbitrary solenoidal (divergence free) wells in dimension three. With this aim we establish weak lower semicontinuity of certain functionals with integrands restricted to generic twodimensional planes and convex in (up to three) rank-2 directions within the planes. Within the framework of the theory of compensated compactness, the latter represe...
متن کاملOn Some Interconnections between Combinatorial Optimization and Extremal Graph Theory
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 273 شماره
صفحات -
تاریخ انتشار 2001